<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    628. Maximum Product of Three Numbers
   </h1>
   <p>
    Given an integer array, find three numbers whose product is maximum and output the maximum product.
   </p>
   <p>
    <b>
     Example 1:
    </b>
   </p>
   <pre>
<b>Input:</b> [1,2,3]
<b>Output:</b> 6
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Example 2:
    </b>
   </p>
   <pre>
<b>Input:</b> [1,2,3,4]
<b>Output:</b> 24
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Note:
    </b>
   </p>
   <ol>
    <li>
     The length of the given array will be in range [3,10
     <sup>
      4
     </sup>
     ] and all elements are in the range [-1000, 1000].
    </li>
    <li>
     Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.
    </li>
   </ol>
   <p>
    &nbsp;
   </p>
  </div>
  <div>
   <h1 class="question_title">
    628. 三个数的最大乘积
   </h1>
   <p>
    给定一个整型数组，在数组中找出由三个数组成的最大乘积，并输出这个乘积。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> [1,2,3]
<strong>输出:</strong> 6
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> [1,2,3,4]
<strong>输出:</strong> 24
</pre>
   <p>
    <strong>
     注意:
    </strong>
   </p>
   <ol>
    <li>
     给定的整型数组长度范围是[3,10
     <sup>
      4
     </sup>
     ]，数组中所有的元素范围是[-1000, 1000]。
    </li>
    <li>
     输入的数组中任意三个数的乘积不会超出32位有符号整数的范围。
    </li>
   </ol>
  </div>
 </body>
</html>